High Resolution Direction Finding Using Krylov Subspace

نویسندگان

  • Hichem SEMIRA
  • Hocine BELKACEMI
  • Sylvie MARCOS
چکیده

This paper proposes two new algorithms for the direction of arrival (DOA) estimation of P radiating sources. Unlike the classical subspace-based methods, they do not resort to the eigen-decomposition of the covariance matrix of the received data. Indeed, the proposed algorithms involve the building of the signal subspace from the Krylov subspace of order P associated with the covariance matrix of the received data and a search steering vector, through either the multi-stage Wiener filter (MSWF) or the conjugate gradient method (CG). The proposed algorithms exhibit a higher super-resolution capability than the classical MUSIC and ESPRIT algorithms. A comparison with another theoretically equivalent Krylov subspace-based algorithm, namely the auxiliary vector basis is also presented. It reveals that the proposed CG-based method outperforms over its counterparts in term of resolution of closely spaced-sources with a small number of snapshots and a low signal-to-noise ratio (SNR).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Beamspace Direction Finding Using Krylov Subspace-Based Algorithms

Motivated by the performance of the direction finding algorithms based on the auxiliary vector filtering (AVF) method and the conjugate gradient (CG) method as well as the advantages of operating in beamspace (BS), we develop two novel direction finding algorithms for uniform linear arrays (ULAs) in the beamspace domain, which we refer to as the BS AVF and the BS CG methods. The recently propos...

متن کامل

Beamspace direction finding based on the conjugate gradient and the auxiliary vector filtering algorithms

Motivated by the performance of the direction finding algorithms based on the auxiliary vector filtering (AVF) method and the conjugate gradient (CG) method as well as the advantages of operating in beamspace (BS), we develop two novel direction finding algorithms for uniform linear arrays (ULAs) in the beamspace domain, which we refer to as the BS AVF and the BS CG methods. The recently propos...

متن کامل

A Cascadic Alternating Krylov Subspace Image Restoration Method

This paper describes a cascadic image restoration method which at each level applies a two-way alternating denoising and deblurring procedure. Denoising is carried out with a wavelet transform, which also provides an estimate of the noise-level. The latter is used to determine a suitable regularization parameter for the Krylov subspace iterative deblurring method. The cascadic multilevel method...

متن کامل

Krylov subspace methods for projected Lyapunov equations

We consider the numerical solution of projected Lyapunov equations using Krylov subspace iterative methods. Such equations play a fundamental role in balanced truncation model reduction of descriptor systems. We present generalizations of the extended block and global Arnoldi methods to projected Lyapunov equations and compare these methods with the alternating direction implicit method with re...

متن کامل

MATLAB Simulation of Subspace based High Resolution Direction of Arrival Estimation Algorithm

Over the past decades there has been technological breakthrough from analog to digital. Ever since the world war and also the invention of electromagnetic radio, there has always been an urge to know from which direction the signals were arriving to the listener’s direction finding receiver. The methodology of determining the direction of arrival (DOA) of incoming signals impinging on the unifo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006